Skip to content

Conversation

@rwst
Copy link
Contributor

@rwst rwst commented Jan 24, 2026

Resolves #1455.

Conjectures associated with A063880

A063880 lists numbers $n$ such that $\sigma(n) = 2 \cdot \text{usigma}(n)$, where $\sigma(n)$ is the
sum of all divisors and $\text{usigma}(n)$ is the sum of unitary divisors.

Equivalently, these are numbers whose unitary and non-unitary divisors have equal sum.

The conjectures state that all members satisfy $n \equiv 108 \pmod{216}$, and that all
primitive terms (those whose proper divisors aren't in the sequence) are powerful numbers,
with $108$ being the only primitive term.

References: oeis.org/A063880

Note: I'm using Claude + Opus for supervised formalization tasks. Claude has no permission to use git on my machine.

@github-actions github-actions bot added the oeis Conjectures from oeis.org label Jan 24, 2026
Copy link
Collaborator

@mo271 mo271 left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks, lgtm!

limitations under the License.
-/
import FormalConjectures.Util.ProblemImports
import FormalConjecturesForMathlib
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
import FormalConjecturesForMathlib

I don't think this is needed

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

oeis Conjectures from oeis.org

Projects

None yet

Development

Successfully merging this pull request may close these issues.

math.CO/0409509 number 35

3 participants